Permutation $p$-value approximation via generalized Stolarsky invariance
نویسندگان
چکیده
منابع مشابه
Permutation p-value approximation via generalized Stolarsky invariance
Abstract: When it is necessary to approximate a small permutation pvalue p, then simulation is very costly. For linear statistics, a Gaussian approximation p̂1 reduces to the volume of a spherical cap. Using Stolarsky’s (1973) invariance principle from discrepancy theory, we get a formula for the mean of (p̂1− p)2 over all spherical caps. From a theorem of Brauchart and Dick (2013) we get such a ...
متن کاملSupplement To: Permutation P -value Approximation via Generalized Stolarsky Invariance
Outline. This is an online supplement to the article “Permutation pvalue approximation via generalized Stolarsky invariance”. The section numbers pick up where the main article left off. Section 11 contains all but the shortest proofs of results in the main document. Section 12 investigates the effect of unbalanced sample sizes on the moments of the reference disributions. Section 13 analyzes t...
متن کاملWandzura-Wilczek approximation from generalized rotational invariance
We present the alternative way of derivation of the Wandzura-Wilczek relations between the kinematical twist-3 and twist-2 functions, parameterizing hadronic matrix element in two-photon processes γπ → γπ and γγ → ππ. The new equations, providing the independence of the physical cross-sections on the choice of the light-cone direction, are suggested and explored. The amplitude of γγ → ππ up to ...
متن کاملApproximation Via Value Unification
Numerical function approximation over a Boolean domain is a classical problem with wide application to data modeling tasks and various forms of learning. A great many function approximation algorithms have been devised over the years. Because the goal is to produce an approximating function that has low expected error, algorithms are typically guided by error reduction. This guiding force, to r...
متن کاملApproximation Via Value Unification1
Numerical function approximation over a Boolean domain is a classical problem with wide application to data modeling tasks and various forms of learning. A great many function approximation algorithms have been devised over the years. Because the goal is to produce an approximating function that has low expected error, algorithms are typically guided by error reduction. This guiding force, to r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Statistics
سال: 2019
ISSN: 0090-5364
DOI: 10.1214/18-aos1702